Exact computation of maximum rank correlation estimator

نویسندگان

چکیده

In this paper we provide a computation algorithm to get global solution for the maximum rank correlation estimator using mixed integer programming (MIP) approach. We construct new constrained optimization problem by transforming all indicator functions into binary parameters be estimated and show that it is equivalent original problem. also consider an application of best subset prediction can reformulated as MIP. derive non-asymptotic bound tail probability predictive performance measure. investigate MIP empirical example Monte Carlo simulations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Limiting Distribution of the Maximum Rank Correlation Estimator

Han’s maximum rank correlation (MRC) estimator is shown to be √ n-consistent and asymptotically normal. The proof rests on a general method for determining the asymptotic distribution of a maximization estimator, a simple U-statistic decomposition, and a uniform bound for degenerate U-processes. A consistent estimator of the asymptotic covariance matrix is provided, along with a result giving t...

متن کامل

The Gaussian rank correlation estimator: robustness properties

The Gaussian rank correlation equals the usual correlation coefficient computed from the normal scores of the data. Although its influence function is unbounded, it still has attractive robustness properties. In particular, its breakdown point is above 12%. Moreover, the estimator is consistent and asymptotically efficient at the normal distribution. The correlation matrix obtained from pairwis...

متن کامل

Exact Computation of Maximum Induced Forest

We propose a backtrack algorithm that solves a generalized version of the Maximum Induced Forest problem (MIF) in time O∗(1.8899n). The MIF problem is complementary to finding a minimum Feedback Vertex Set (FVS), a well-known intractable problem. Therefore the proposed algorithm can find a minimum FVS as well. To the best of our knowledge, this is the first algorithm that breaks the O∗(2n) barr...

متن کامل

Maximum rank correlation training for statistical machine translation

We propose Maximum Ranking Correlation (MRC) as an objective function in discriminative tuning of parameters in a linear model of Statistical Machine Translation (SMT). We try to maximize the ranking correlation between sentence level BLEU (SBLEU) scores and model scores of the N-best list, while the MERT paradigm focuses on the potential 1best candidates of the N-best list. After we optimize t...

متن کامل

Exact computation of bivariate projection depth and the Stahel-Donoho estimator

The idea of data depth provides a new and promising methodology for multivariate nonparametric analysis. Nevertheless, the computation of data depth and the depth function has remained as a very challenging problem which has hindered the methodology from becoming more prevailing in practice. The same is true for the powerful Stahel–Donoho (S–D) estimator. Here, we present an exact algorithm for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Econometrics Journal

سال: 2021

ISSN: ['1368-423X', '1367-423X', '1368-4221']

DOI: https://doi.org/10.1093/ectj/utab013